Computability and Numberings
نویسندگان
چکیده
The theory of computable numberings is one of the main parts of the theory of numberings. The papers of H. Rogers [36] and R. Friedberg [21] are the starting points in the systematical investigation of computable numberings. The general notion of a computable numbering was proposed in 1954 by A.N. Kolmogorov and V.A. Uspensky (see [40, p. 398]), and the monograph of Uspensky [41] was the first textbook that contained several basic results of the theory of computable numberings. The theory was developed further by many authors, and the most important contribution to it and its applications was made by A.I. Malt’sev, Yu.L. Ershov, A. Lachlan, S.S. Goncharov, S.A. Badaev, A.B. Khutoretskii, V.L. Selivanov, M. Kummer, M.B. Pouer-El, I.A. Lavrov, S.D. Denisov, and many other authors.
منابع مشابه
Partial Numberings and Precompleteness
Precompleteness is a powerful property of numberings. Most numberings commonly used in computability theory such as the Gödel numberings of the partial computable functions are precomplete. As is well known, exactly the precomplete numberings have the effective fixed point property. In this paper extensions of precompleteness to partial numberings are discussed. As is shown, most of the importa...
متن کاملA note on partial numberings
The different behaviour of total and partial numberings with respect to the reducibility preorder is investigated. Partial numberings appear quite naturally in computability studies for topological spaces. The degrees of partial numberings form a distributive lattice which in the case of an infinite numbered set is neither complete nor contains a least element. Friedberg numberings are no longe...
متن کاملElementary Properties of Rogers Semilattices of Arithmetical Numberings
We investigate differences in the elementary theories of Rogers semilattices of arith-metical numberings, depending on structural invariants of the given families of arithmetical sets. It is shown that at any fixed level of the arithmetical hierarchy there exist infinitely many families with pairwise elementary different Rogers semilattices. For unexplained terminology and notations relative to...
متن کاملAn Isomorphism Theorem for Partial Numberings
As is well-known, two equivalent total numberings are computably isomorphic, if at least one of them is precomplete. Selivanov asked whether a result of this type is true also for partial numberings. As has been shown by the author, numberings of this kind appear by necessity in studies of effectively given topological spaces like the computable real numbers. In the present paper it is demonstr...
متن کاملKolmogorov numberings and minimal identification
Identification of programs for computable functions from their graphs by algorithmic devices is a well studied problem in learning theory. Freivalds and Chen consider identification of ‘minimal’ and ‘nearly minimal’ programs for functions from their graphs. To address certain problems in minimal identification for Gödel numberings, Freivalds later considered minimal identification in Kolmogorov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007